• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    Systems and methods for selecting potential sink locations in a reservoir matrix model using a matrix block size delineation box for calculating a total initial in-place gas (OGIP) and / or an initial oil in place (OOIP) for each delineation box associated with a potential well location.
    公开号:FR3033432A1
    申请号:FR1650803
    申请日:2016-02-02
    公开日:2016-09-09
    发明作者:Feng Wang
    申请人:Landmark Graphics Corp；
    IPC主号:
    专利说明:

    [0001] SELECTING POTENTIAL WELL LOCATIONS IN A MATERIAL TANK MODEL CROSS REFERENCE TO RELATED APPLICATIONS [0001] Nil FEDERAL SPONSORING RESEARCH DECLARATION [0002] NONE FIELD OF THE DESCRIPTION [0003] The present disclosure generally relates to systems and systems of the present invention. methods of selecting potential pit locations in a reservoir matrix model. More particularly, the present disclosure relates to the selection of potential pit locations in a reservoir matrix model using a bounding box with matrix block dimensions for calculating a total initial on-site gas (OGIP) and / or on-site oil. initial (OOIP) for each of the bounding boxes associated with a potential well location. BACKGROUND [0004] In the oil and gas industry, a field development plan (FDP) is required before the development of an oil or gas field can begin. An FDP is based on a digital reservoir simulation model that is also called a reservoir matrix model. The reservoir matrix model includes multiple matrix blocks of the same size and predefined dimensions (DX, DY, DZ). Each matrix block contains information on the reservoir such as, for example, the porosity for each matrix block: 4, the initial water saturation for each matrix block: 3033432 Swi, and the net-to-gross ratio for each matrix block: NTG. The reservoir matrix model contains matrix block dimensions (i, j, k) that represent the number of matrix blocks in each dimension. The main objective of the FDP is to optimize hydrocarbon recovery by determining the best number of potential wells, their type and location. Vertical wells are a natural first choice because of their ease of drilling, low cost and low inherent risk. [0005] Tank simulation normally takes a long time to execute, especially for large tank matrix models. Previous attempts require a large number of simulation tests regardless of the advanced mathematical or statistical process that is used. The reason is that every movement in a potential well to a new location must guarantee a new simulation test. For example, for a simple case of 2 wells to be optimized and 10 potential locations for each well, it takes 10x10 = 100 simulation tests to look for all possible combinations of well locations. For the optimization of a large number of wells, the number of simulation tests required is prohibitive in terms of cost and / or time. BRIEF DESCRIPTION OF THE DRAWINGS [0006] The present description given below with reference to the accompanying drawings in which like elements are referenced with like reference numerals, and among which: [0007] Figs. 1A-1B. are a flow diagram illustrating an embodiment of a method of implementing the present disclosure. Figure 2. is a representation of a partial matrix model of tank 2 3033432 illustrating step 106 in the figure.
    [0002] 1A. Figure 3 is a representation of a partial reservoir matrix model illustrating steps 108-110 in Figure 1A. FIG. 4 is a flow diagram illustrating an embodiment of a computer system for implementing the present disclosure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS [0011] The present disclosure overcomes at least one prior art defect by providing systems and methods for selecting potential sink locations in a reservoir array model using a bounding box having matrix block dimensions for calculating a total initial gas in place (OGIP) and / or an initial oil in place (OOIP) for each delimiting box associated with a potential sink location. According to one embodiment, the present description comprises a method of selecting potential pit locations in a tank, which comprises: a) selecting a matrix block size delineation box; b) selecting a surface matrix block for a potential sink location in a reservoir matrix model comprising multiple matrix blocks; c) positioning the bounding box around the surface matrix block; (d) calculating a total initial in-place gas in the bounding box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps b) to d) for each surface matrix block in the reservoir matrix model using a computer processor; and f) selecting a largest total initial in-place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for one. ideal pit location. According to another embodiment, the present description comprises a device carrying a non-transitory computer-executable instruction transport program for selecting potential pit locations in a tank, the instructions being executable to implement work: a) the selection of a delimitation box with 5 dimensions of matrix blocks; b) selecting a surface matrix block for a potential well location in a reservoir matrix model comprising multiple matrix blocks; c) positioning the bounding box around the surface matrix block; (d) calculating a total initial in-place gas in the bounding box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps 10b) to d) for each surface matrix block in the reservoir matrix model; and f) selecting a largest total initial in-place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for an ideal well location. [0014] According to yet another embodiment, the present disclosure comprises a device carrying a non-transitory computer executable instruction transport program for selecting potential pit locations in a tank, the instructions being executable for implementation: a) the selection of a delimitation box; b) selecting a surface matrix block for a potential well location in a reservoir matrix model comprising multiple matrix blocks; c) the positioning of the delimiting box around the surface matrix block; (d) calculating a total initial in-place gas in the bounding box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps b) to d) for each surface matrix block in the reservoir matrix model; f) selecting a largest total initial in-place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for an ideal well location; and g) selecting each total initial in-place gas calculated for a bounding box 5 positioned around a surface matrix block that is in a predefined number of surface matrix blocks from the surface matrix block with coordinates. corresponding to the best well location. The subject of the present description is specifically described; however, the description itself is not intended to limit the scope of the description. The subject may therefore also be implemented in other ways to understand different steps or combinations of steps similar to those described herein, in conjunction with other present or future technologies. In addition, although the term "step" may be used herein to describe various process elements employed, the term should not be construed as implying any particular constraint among or between various steps described herein unless otherwise expressly limited by the description. to a particular constraint. While the present description can be applied to the oil and gas industry, it is not limited to it and can also be applied in other industries such as, for example, the exploitation of water or coal to achieve similar results.
    [0003] Process Description [0016] Logically, a well drilled by matrix blocks with greater permeability and / or OGIP must give a higher expected output. For a conventional oil or gas reservoir, the long-term performance of a well is more dependent on OGIP attached to the well than permeability. In addition, permeability is usually related to porosity (or pore volume). As such, the sum of OGIP for the matrix blocks that must be penetrated by a potential well and the neighboring matrix blocks is an indicator of where the potential sink should be. In the following description, a gas field is chosen as an example for the sake of brevity, but the process can also be applied to an oil field. Referring now to Figures 1A-1B, a process diagram 100 is illustrated to implement the present description. In step 102, a bounding box is automatically selected with matrix block dimensions (i, j, k). Otherwise, the delimitation box can be chosen using the client interface and / or the video interface described below in connection with FIG. 4. It is preferred that the matrix block dimensions (i, j) be the same odd number representing a preferred length and width of the bounding box and the matrix block k represents the depth of the bounding box which substantially corresponds to the depth of the matrix block of the reservoir matrix pattern. The matrix block dimensions (i, j) may be arbitrarily selected or may be based on a drainage area or by trial and error. In step 104, any surface array block is selected for a potential sink location in a reservoir array model. Any surface matrix pattern of the reservoir matrix template 3033432 may be chosen as a potential well location because step 112 must repeat until any surface matrix block of the reservoir array pattern has been chosen. for a potential pit location. And we consider only the surface matrix blocks for potential well locations because the potential wells are vertical wells and each vertical well must traverse the same respective matrix block coordinates (i, j) in the matrix model of tank. In step 106, the delimiting box chosen in step 102 is positioned around the surface matrix block chosen in step 104 so that one side of the delimiting box is adjacent to an outer side of the the surface matrix block in step 104 and that the surface matrix block is equidistant between the matrix block dimensions (i, j) of the bounding box. In Fig. 2, for example, a display 200 of a partial reservoir matrix model can be used to illustrate this step. The bounding box 202 is located around the surface matrix block 204 selected for a potential well location 206. Only one side of the bounding box 202 is visible in the display 200. This side of the bounding box 202 is bordering with an outer side of the surface matrix block 204 and the surface matrix block 204 is equidistant between the matrix block dimensions (i, j) (5x5) of the bounding box 202. [0021] In step 108, the OGIP is calculated for each matrix block in the delimiting box set in step 106. OGIP = DX * DY * DZ * 4 * NTG * (1-Swi) where each matrix block has the same predetermined dimensions (DX , DY, DZ) and reservoir information such as, for example, the porosity for each matrix block: c, the initial water saturation for each matrix block: Swi, and the net-to-gross ratio for each matrix block. : NTG. In Fig. 3, for example, a display 300 of a partial reservoir matrix model may serve to illustrate this step. The bounding box 302 is located around the surface matrix block 304 selected for a potential well location 306. The OGIP is calculated for each matrix block in the bounding box 302, which contains (i, j) block dimensions matrix (5x5) and the matrix block dimension k 308 appearing in an exploded view. In step 110, the total OGIP in the delimiting box is calculated using the OGIP for each matrix block calculated in step 108. In FIG. 3, for example, the OGIP for each. The matrix block present in bounding box 302 is summed for the total OGIP of bounding box 302. In step 112, method 100 determines whether there is another surface pattern block for a location. of potential wells in the reservoir matrix model. If there is another surface array block for a potential sink location in the reservoir array model, then the process 100 returns to step 104 to select another surface array block for a potential sink location in the model. matrix 15 tank. Otherwise, process 100 proceeds to step 114. [0024] In step 114, the total OGIP calculated at step 110 for each bound box associated with a potential well location is ranked from largest to largest. small or vice versa. Each surface matrix block chosen for a potential sink location in the reservoir matrix model is thus classified in this manner. In step 116, the largest total OGIP of step 114 is chosen, which represents the surface matrix block coordinate box (i, j) for the best potential well location. In step 118, method 100 determines whether there is another total OGIP of step 114 that was not selected at step 116 or step 124. In case of If there is no total OGIP choice in step 114, then the method 100 terminates with the surface matrix block coordinates (i, j) for the best potential well location and preferably at least one block coordinate. surface matrix (i, j) for the next best potential well site (s). It is possible, however, that the method 100 may terminate with only the surface matrix block coordinates (i, j) for the best potential well location. In the case of another OGIP of step 114 which has not been selected, then process 100 proceeds to step 120. [0027] In step 120, the next largest total OGIP of step 114 is identified. In step 122, the method 100 determines whether the surface array block for the potential sink location associated with the bounding box for the next largest larger OGIP identified in step 120 is part of a predefined number of surface matrix blocks from the surface matrix block while the best selection of potential well location has been chosen selected at step 116. If the surface matrix block intended for the location of potential well associated with the bounding box for the largest total OGIP identified in step 120 is not part of a predefined number of surface matrix blocks from the surface array block with the best potential well location at the same time. step 116, then method 100 returns to step 118. Otherwise, method 100 proceeds to step 124.
    [0004] A predefined number of surface matrix blocks is used to prevent the selected wells from clustering around areas with good reservoir properties. While the predefined number of surface matrix blocks may be arbitrarily chosen or may be based on the economics of drilling a well, at least two matrix blocks may be used because the selected wells would otherwise be too close for a well. accurate tank simulation. In step 124, the next largest total OGIP identified in step 120 is selected, which represents the bounding box with surface matrix block coordinates (i, j) for the next best location. potential wells. Process 100 then returns to step 118. When applied to an oilfield, process 100 must replace OGIP with 00IP = DX * DY * DZ * cleNTG * (1-Swi). At the end of process 100, the results can be used to determine the type and number of wells in the FDP and especially their location to start drilling operations. If, for example, there are ten potential sink locations selected by the method 100 in order ranked from best, next best, and so on, the two best locations can be selected if the financial constraints are limited to two wells. Optionally, the bounding box size at step 102 and the predefined number of surface matrix blocks (i.e., the minimum spacing between wells) at step 122 may vary with each iteration of the whole process 100 to compare the differences, if any, and optimize the selection of the best potential well locations with the highest possible recovery of oil and / or gas. Method 100 is therefore very efficient and flexible in selecting the best potential well locations by using a bounding box and a minimum inter-well spacing (i.e., a predefined number of surface matrix blocks). ). And the method 100 requires fewer simulation tests compared to conventional techniques. One simulation test is required for each iteration of the process 100. In most cases, it takes less than ten simulation tests to obtain the best potential well locations, regardless of the number of well locations. potential (ie matrix blocks). Thus, one can save a lot of time for designing an FDP. Take, for example, a typical matrix matrix model whose matrix block dimensions are 100x100x20 and 10 planned wells. A conventional well optimization technique moves all 10 planned wells around each potential well location into the reservoir matrix model. A simulation test is required after each well is moved to a new potential well location.
    [0005] If each well has only 10 potential well locations, then the total number of simulation runs for a complete combination is 101 °, that is, ten million. Even with an advanced mathematical or statistical method such as a neural network, a large number of simulation tests remain necessary. The simulation time for such a reservoir size usually reaches 1 hour for a fast multi-CPU workstation, so that the required simulation time is prohibitive in terms of cost and / or time.
    [0006] System Description [0032] This description can be implemented through a computer-executable instruction program, for example program modules, which are generally referred to as software applications or application programs. executed by a computer. The software may for example include subroutines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular types of abstract data. The software forms an interface to allow a computer to react according to a source of input stimulation.
    [0007] NexusTM, a commercial software application marketed by Landmark Graphics can serve as an interface application for implementing this disclosure. The software may also cooperate with other code segments to perform a number of tasks in response to data received in connection with the source of the received data. Other code segments may provide optimization components including but not limited to neural networks, Earth modeling, history matching, optimization, visualization, data management, simulation of reservoir and saving works. The software may be stored and / or ported to a number of memories such as CD-ROMs, a magnetic disk, a bubble memory and a semiconductor memory (eg various types of RAM or ROM). In addition, the software and its results can be transmitted over a number of media media such as an optical fiber, a wire and / or across a number of networks, such as the Internet. In addition, those skilled in the art will appreciate that the description can be practiced with a number of computer system configurations, particularly portable devices, multi-processor systems, microprocessor-based electronics, or the like. programmable consumables, minicomputers, mainframes and the like. Any number of computer systems and computer networks are possible within the scope of the present invention. The description may be implemented in distributed computing environments where the tasks are performed by remote processing devices that are linked through a telecommunication network. In a distributed computing environment, program modules may be in local and remote computer storage media including memory storage devices. The present disclosure may therefore be implemented in connection with various hardware, software or a combination thereof in a computer system or other data processing systems. Referring now to Figure 4, a flowchart illustrates an embodiment of a system for implementing the present description on a computer. The system includes a computing unit, sometimes called a computing system, which contains a memory, application programs, a client interface, a video interface and a processing unit. The computer unit is just one example of an appropriate computing environment and is not intended to suggest any limitation on the scope or functionality of the description. The memory mainly stores the application programs, which can also be called program modules containing computer executable instructions, executed by the computer unit to implement the present description described here and illustrated in FIGS. 1-3. The memory thus contains a location selection module of 13 3033432 potential wells, which makes it possible to reach each stage of the figures.
    [0008] 1A-1B. The potential sink location module can integrate functionality from the remaining application programs illustrated in Figure 4. In particular, Nexus TM can serve as an interface application to provide the tank matrix model used by the method 100 in the figures.
    [0009] 1A-1B. Although Nexus TM can be used as an interface application, other interface applications can be used in its place, or the potential sink location module can be used as a stand-alone application. Although the computer unit appears to have generalized memory, the computer unit typically includes a number of computer readable media. By way of example, and without limitation, computer readable media may include computer storage media and telecommunication media. The computer system memory may contain computer storage media in the form of volatile and / or nonvolatile memory such as a read-only memory (ROM) and a random access memory (RAM). A basic input / output (BIOS) system, containing the basic subprograms that facilitate the transfer of information between elements in the computer unit, particularly during startup, is usually recorded in ROM. The RAM typically contains data and / or program modules that are immediately accessible and / or in operation on the processing unit. By way of example, and without limitation, the computer unit contains an operating system, application programs, other program modules, and program data. The components appearing in the memory may also be part of other removable / non-removable, volatile / nonvolatile recording media, or they may be implemented in the computer unit through a application program interface ("API") or cloud computing connected through a computer system or network. By way of example only, a hard disk player can read from or write to a non-removable, nonvolatile magnetic medium, a magnetic disk reader can read from or write to a nonvolatile removable magnetic disk, and The optical disk can read from or write to a removable, nonvolatile optical disk such as a CD ROM or other optical medium. Other volatile / nonvolatile removable / non-removable computer recording media that may be employed in the exemplary operating environment may include, but are not limited to, magnetic tape cassettes, flash cards , digital versatile discs, digital video tape, semiconductor RAM, semiconductor ROM and similar media. The readers and their recording media associated with the aforementioned computers allow storage of computer readable instructions, data structures, program modules and other data for the computer unit. A customer may either enter commands and information into the computer unit through the client interface, which may correspond to input devices such as a keyboard and pointing device, that we usually call a mouse, a trackball or a tactile keyboard. The input devices may include a microphone, a joystick, a satellite dish, a scanner, voice recognition or gestural recognition, or the like. These devices and other input devices are often connected to the data processing unit through the client interface that is coupled to a system bus, but they can be connected by other structures. 3033432 interface and bus type, such as a parallel port or a universal serial bus (USB). A screen or other type of display device may be connected to the system through an interface, such as a video interface. A graphical user interface ("GUI") may also be used with the video interface to receive instructions from the client interface and to transmit the instructions to the data processing unit. In addition to the display, computers may also include other peripheral output devices, such as speakers and a printer, that may be connected through an output device interface. [0040] Although other internal components of the computer unit do not appear, the specialists will appreciate that these components and their interconnections are known. After presenting the present description in connection with presently preferred embodiments, the specialists will understand that it is not limited to the description of these embodiments. It is therefore contemplated that various other embodiments and modifications may be made to the described embodiments without departing from the spirit and scope of the description as defined by the appended claims and their equivalents.
    权利要求:
    Claims (20)
    [0001]
    REVENDICATIONS1. A method of selecting potential pit locations in a reservoir, comprising; a) the selection of a bounding box with matrix block dimensions; b) selecting a surface matrix block for a potential well location in a reservoir matrix model comprising multiple matrix blocks; C) positioning the bounding box around the surface matrix block; (d) calculating a total initial in-place gas in the bounding box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps b) to d) for each surface matrix block in the reservoir matrix model using a computer processor; and f) selecting a largest total initial in-place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for a better well location.
    [0002]
    The method of claim 1, further comprising using the surface matrix block coordinates for the best well location for drilling a well. 17 3033432
    [0003]
    The method of claim 1, wherein the dimensions of the matrix block corresponding to the bounding box are the same odd number representing a preferred length and width of the bounding box, and wherein a depth of the bounding box substantially matches at a matrix block depth of the reservoir matrix model.
    [0004]
    The method of claim 3, wherein the bounding box is positioned around the selected surface area block so that one side of the bounding box is adjacent to an outer side of the selected surface area block, and where the The selected area matrix block is equidistant between the preferred length and width of the bounding box.
    [0005]
    The method of claim 1, wherein each matrix block in the reservoir matrix model has the same dimensions.
    [0006]
    The method of claim 1, further comprising: g) selecting each total initial in-place gas calculated for a bounding box positioned around a surface matrix block that is in a predefined number of surface matrix blocks from the surface matrix block whose coordinates are those of the best well location.
    [0007]
    The method of claim 6, wherein each selected initial in-place gas represents a delimiting box whose coordinates are those of a potential well location. 183033432
    [0008]
    The method of claim 7, further comprising using the surface matrix block coordinates for the best well location and each potential well location to prepare a field development plane.
    [0009]
    The method of claim 7, which repeats steps a) through g) using another bounding box and another predefined number of surface matrix blocks.
    [0010]
    A non-transient program support device tangibly carrying computer executable instructions for selecting potential pit locations in a tank, the instructions being executable to implement: a) selecting a bounding box at matrix block dimensions; B) selecting a surface matrix block for a potential well location in a reservoir matrix model comprising multiple matrix blocks; c) positioning the bounding box around the surface matrix block; (D) calculating a total initial in-place gas in the bounding box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps b) to d) for each surface matrix block in the reservoir matrix model; and selecting the largest total initial in place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for a better well location.
    [0011]
    The program support device of claim 10, further comprising using the surface matrix block coordinates for the best well location for drilling a well.
    [0012]
    The program support apparatus according to claim 10, wherein the matrix block dimensions for the bounding box are the same odd number representing a preferred length and width of the bounding box and a depth of the check box. delimitation corresponds substantially to a matrix block depth of the reservoir matrix model.
    [0013]
    The program support device of claim 12, wherein the bounding box is positioned around the selected surface area block so that one side of the bounding box is bordering with an outer side of the selected surface area block and wherein the selected surface area block is equidistant from the preferred length and width of the bounding box.
    [0014]
    The program support device according to claim 10, wherein each matrix block present in the reservoir matrix model has the same dimensions.
    [0015]
    15, a program support device according to claim 10, further comprising: 3033432 g) selecting each total initial in place gas calculated for a bounding box positioned around a surface matrix block that is within a number predefined pattern of surface matrix blocks from the surface matrix block whose coordinates are those of the best well location. 5
    [0016]
    The program support device of claim 15, wherein each selected initial in-place gas represents a bounding box whose surface matrix block coordinates correspond to a potential well location.
    [0017]
    The program support apparatus of claim 16, further comprising using the surface matrix block coordinates for the best well location and each potential well location to prepare a field development plane.
    [0018]
    The program support device of claim 16, which repeats steps a) through g) using another bounding box and another predefined number of surface matrix blocks. 15
    [0019]
    19. A non-transient program support device tangibly carrying computer executable instructions for selecting potential sink locations in a tank, the instructions being executable to implement: a) selecting a bounding box; B) selecting a surface matrix block for a potential well location in a reservoir matrix model comprising multiple matrix blocks; positioning the bounding box around the surface matrix block; d) calculating a total initial in-place gas in the delimiting box using an initial in-place gas for each matrix block in the bounding box; e) repeating steps b) to d) for each matrix block of the reservoir matrix model; Selecting a larger initial in-place gas calculated for a bounding box, which represents a surface matrix block coordinate bounding box for a better well location; and g) selecting each total initial in-place gas calculated for a bounding box positioned around a surface matrix block that is in a predefined number of surface matrix blocks from the surface matrix block whose coordinates are those of the best well site.
    [0020]
    The method of claim 19, further comprising using the surface matrix block coordinates for the best well location for drilling a well. 20 22
    类似技术:
    公开号 | 公开日 | 专利标题
    FR3035674A1|2016-11-04|SHADE GEOMECHANICS FOR HYDRAULIC MULTI-STAGE FRACTURING OPTIMIZATION IN SCHOOL RESOURCES AND GREEN GAMES
    FR3033432A1|2016-09-09|
    FR3062873A1|2018-08-17|AUTOMATION OF THE HIGHER SCALE OF RELATIVE PERMEABILITY AND CAPILLARY PRESSURE IN MULTIPLE POROSITY SYSTEMS
    FR3038338A1|2017-01-06|CORRECTION OF DEVIATION AND DISPERSION EFFECTS ON ACOUSTICAL DIAGRAM MEASUREMENTS OF WELLS DUE TO STRATIFIED FORMATIONS
    FR3064755A1|2018-10-05|AUTOMATED WELL DIAGRAPH CORRELATION USING DESCRIPTORS
    CA2913193A1|2014-12-24|Systems and methods for displaying wells and their respective status on an electronic map
    Khvostichenko et al.2018|Oilfield Data Analytics: Linking Fracturing Chemistry and Well Productivity
    AU2017219128A1|2017-09-14|Systems and methods for identifying geological core areas
    US20160138371A1|2016-05-19|Systems and Methods For Optimizing Existing Wells and Designing New Wells Based on the Distribution of Average Effective Fracture Lengths
    FR3057980A1|2018-04-27|CLASSIFICATION OF WELL DATA USING A SUPPORT VECTOR MACHINE
    FR3038108A1|2016-12-30|VISUALIZATION OF QUANTITATIVE DATA OF DRILLING OPERATIONS RELATED TO A TUBE BLOCKING EVENT
    US20150301870A1|2015-10-22|Systems and Methods for Reordering Sequential Actions
    CA2905228C|2016-12-20|Systems and methods for adjusting existing well plans
    FR3086321A1|2020-03-27|WELL OPERATIONS INVOLVING A SYNTHETIC INJECTION FRACTURE TEST
    FR3049735A1|2017-10-06|VISUALIZATION OF ATTRIBUTES OF MULTIPLE SURFACES OF FAILURE IN REAL TIME
    US9874094B2|2018-01-23|Identifying formation layer boundaries on well log measurements
    FR3032222A1|2016-08-05|PRIORI UNCERTAINTY PARAMETER ARCHITECTURE INTEGRATED IN SIMULATION MODEL CREATION
    FR3040509A1|2017-03-03|
    FR3048300A1|2017-09-01|3D GEOCELLULAR HYBRID REPRESENTATION OF SELECTED NATURAL FRACTURE NETWORK SUBASSEMBLIES
    FR3031605A1|2016-07-15|FILTERING AND DATA ANALYSIS BY MULTI-LEVEL TREES WITH COMPOSITE VARIABLES
    US20190004197A1|2019-01-03|Updating models of complex geological sequences field of the disclosure
    US20190179046A1|2019-06-13|System and Method for Reservoir Facies Classification That Segments Both Petrophysical and Geophysical Properties
    US20180217286A1|2018-08-02|Selecting logging data for petrophysical modelling and completion optimization
    FR3087274A1|2020-04-17|CALIBRATION OF REPETITIVE SEISMIC IMAGES FOR PRODUCTION OPERATIONS
    FR3054059A1|2018-01-19|DETERMINATION OF A DIGITAL AGE FOR GEOLOGICAL EVENTS WITHIN A SCHEME
    同族专利:
    公开号 | 公开日
    AU2015384813A1|2017-08-10|
    GB2549910A|2017-11-01|
    WO2016140645A1|2016-09-09|
    CA2975437C|2019-09-10|
    AR103602A1|2017-05-24|
    US20180003007A1|2018-01-04|
    NO344822B1|2020-05-11|
    GB201712347D0|2017-09-13|
    CA2975437A1|2016-09-09|
    NO20171185A1|2017-07-14|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    FR2886743B1|2005-06-02|2007-07-27|Inst Francais Du Petrole|METHOD FOR SIMULATING FLUID FLOWS WITHIN A RESERVOIR USING CHIMERE-TYPE DISCRETISATION|
    RU2486336C2|2007-11-01|2013-06-27|Лоджинд Б.В.|Method of formation breakdown simulation and its estimation, and computer-read carrier|
    US20100114909A1|2008-11-05|2010-05-06|Digital Domain Productions, Inc.|System and method for improved grid processing|
    US8301426B2|2008-11-17|2012-10-30|Landmark Graphics Corporation|Systems and methods for dynamically developing wellbore plans with a reservoir simulator|
    KR101269943B1|2010-12-02|2013-05-31|주식회사 엘지화학|Manufacture Device of Battery Cell|
    US20130262069A1|2012-03-29|2013-10-03|Platte River Associates, Inc.|Targeted site selection within shale gas basins|
    AU2013377864B2|2013-02-11|2016-09-08|Exxonmobil Upstream Research Company|Reservoir segment evaluation for well planning|
    CA2909170C|2013-06-10|2020-02-18|Exxonmobil Upstream Research Company|Determining well parameters for optimization of well performance|
    US10584570B2|2013-06-10|2020-03-10|Exxonmobil Upstream Research Company|Interactively planning a well site|EP3008285A4|2013-06-12|2017-04-05|Services Petroliers Schlumberger|Well trajectory planning using bounding box scan for anti-collision analysis|
    WO2019075250A1|2017-10-11|2019-04-18|Beyond Limits, Inc.|Recommendation engine for a cognitive reservoir system|
    CN110441815B|2019-08-23|2021-05-25|电子科技大学|Simulated annealing Rayleigh wave inversion method based on differential evolution and block coordinate descent|
    法律状态:
    2017-01-23| PLFP| Fee payment|Year of fee payment: 2 |
    2018-01-29| PLFP| Fee payment|Year of fee payment: 3 |
    2019-01-22| PLFP| Fee payment|Year of fee payment: 4 |
    2020-11-06| ST| Notification of lapse|Effective date: 20201005 |
    优先权:
    申请号 | 申请日 | 专利标题
    PCT/US2015/018319|WO2016140645A1|2015-03-02|2015-03-02|Selecting potential well locations in a reservoir grid model|
    [返回顶部]